AlmostH-factors in dense graphs
نویسندگان
چکیده
The following asymptotic result is proved. For every fixed graph H with h vertices, any graph G with n vertices and with minimum degree d ≥ χ(H)−1 χ(H) n contains (1− o(1))n/h vertex disjoint copies of H. ∗Research supported in part by a United States Israel BSF Grant and by a Bergmann Memorial Grant
منابع مشابه
Uniform Generation of d-Factors in Dense Host Graphs
Given a constant integer d ≥ 1 and a host graph H that is sufficiently dense, we lower bound the number of d-factors H contains. When the complement of H is sufficiently sparse, we provide an algorithm that uniformly generates the d-factors of H and we justify the efficiency of the algorithm.
متن کاملOn the Benfits of Adaptivity in Property Testing of Dense Graphs
We consider the question of whether adaptivity can improve the complexity of property testing algorithms in the dense graphs model. Goldreich and Trevisan (Random Structures and Algorithms, 2003) have shown that there can be at most a quadratic gap between adaptive and non-adaptive testers in this model, but it was not known whether any gap indeed exists. In this work we reveal such a gap. Spec...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملCharacterisations of Nowhere Dense Graphs
Nowhere dense classes of graphs were introduced by Nešetřil and Ossona de Mendez as a model for “sparsity” in graphs. It turns out that nowhere dense classes of graphs can be characterised in many different ways and have been shown to be equivalent to other concepts studied in areas such as (finite) model theory. Therefore, the concept of nowhere density seems to capture a natural property of g...
متن کاملImproved Bounds for Shortest Paths in Dense Distance Graphs
We study the problem of computing shortest paths in so-called dense distance graphs. Every planar graph G on n vertices can be partitioned into a set of O(n/r) edge-disjoint regions (called an r-division) with O(r) vertices each, such that each region has O( √ r) vertices (called boundary vertices) in common with other regions. A dense distance graph of a region is a complete graph containing a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 8 شماره
صفحات -
تاریخ انتشار 1992